Analysis of a Gas Circuit Breaker Using the Fast Moving Least Square Reproducing Kernel Method
نویسندگان
چکیده
منابع مشابه
Moving least-square reproducing kernel method Part II: Fourier analysis
In Part I of this work, the moving least-square reproducing kernel (MLSRK) method is formulated and implemented. Based on its generic construction, an m-consistency structure is discovered and the convergence theorems are established. In this par\ of the work, a systematic Fourier analysis is employed to evaluate and further establish the method. The preliminary Fourier analysis reveals that th...
متن کاملMoving Least Square Reproducing Kernel Method ( III ) : Wavelet Packet & Its
This work is a natural extension of the work done in Part II of this series. A new partition of unity | the synchronized reproducing kernel (SRK) interpolant|is proposed within the framework of moving least square reproducing kernel representation. It is a further development and generalization of the reproducing kernel particle method (RKPM), which demonstrates some superior computational capa...
متن کاملMoving least-square reproducing kernel methods (I) Methodology and convergence
This paper formulates the moving least-square interpolation scheme in a framework of the so-called moving least-square reproducing kernel (MLSRK) representation. In this study, the procedure of constructing moving least square interpolation function is facilitated by using the notion of reproducing kernel formulation, which, ‘as a generalization of the early discrete approach, establishes a con...
متن کاملFast Least Square Matching
Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...
متن کاملReproducing Kernel Banach Spaces with the ℓ1 Norm II: Error Analysis for Regularized Least Square Regression
A typical approach in estimating the learning rate of a regularized learning scheme is to bound the approximation error by the sum of the sampling error, the hypothesis error and the regularization error. Using a reproducing kernel space that satisfies the linear representer theorem brings the advantage of discarding the hypothesis error from the sum automatically. Following this direction, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Electrical Engineering and Technology
سال: 2009
ISSN: 1975-0102
DOI: 10.5370/jeet.2009.4.2.272